A Class of Rational n-WFSM Auto-intersections

نویسندگان

  • André Kempe
  • Jean-Marc Champarnaud
  • Jason Eisner
  • Franck Guingne
  • Florent Nicart
چکیده

Weighted finite-state machines with n tapes describe n-ary rational string relations. The join n-ary relation is very important regarding to applications. It is shown how to compute it via a more simple operation, the auto-intersection. Join and auto-intersection generally do not preserve rationality. We define a class of triples 〈A, i, j〉 such that the auto-intersection of the machine A w.r.t. tapes i and j can be computed by a delay-based algorithm. We point out how to extend this class and hope that it is sufficient for many practical applications.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Selected Operations, Algorithms, and Applications of n-Tape Weighted Finite-State Machines

A weighted finite-state machine with n tapes (n-WFSM) defines a rational relation on n strings. The paper recalls important operations on these relations, and an algorithm for their auto-intersection. Through a series of practical applications, it investigates the augmented descriptive power of n-WFSMs, w.r.t. classical 1and 2-WFSMs (acceptors and transducers). Some applications are not feasibl...

متن کامل

Viterbi Algorithm Generalized for n-Tape Best-Path Search

We present a generalization of the Viterbi algorithm for identifying the path with minimal (resp. maximal) weight in a n-tape weighted finite-state machine (n-WFSM), that accepts a given n-tuple of input strings 〈s1, . . . sn〉. It also allows us to compile the best transduction of a given input n-tuple by a weighted (n+m)-WFSM (transducer) with n input and m output tapes. Our algorithm has a wo...

متن کامل

On binomial equations defining rational normal scrolls

We show that a rational normal scroll can in general be set-theoretically defined by a proper subset of the 2-minors of the associated two-row matrix. This allows us to find a class of rational normal scrolls that are almost settheoretic complete intersections.

متن کامل

On rational groups with Sylow 2-subgroups of nilpotency class at most 2

A finite group $G$ is called rational if all its irreducible complex characters are rational valued. In this paper we discuss about rational groups with Sylow 2-subgroups of nilpotency class at most 2 by imposing the solvability and nonsolvability assumption on $G$ and also via nilpotency and nonnilpotency assumption of $G$.

متن کامل

Effects of Rickshaws and Auto-rickshaws on the Capacity of Urban Signalized Intersections

Non-motorized vehicles (i.e. rickshaws) and small size motorized vehicles (i.e. auto-rickshaws) are popular para-transit modes that provided door-to-door service in congested parts of Dhaka metropolitan area. Improper design of signal timing at signalized intersections is one of the reasons of traffic congestion in Dhaka metropolitan area. For capacity analysis, to convert the mixed traffic flo...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2005